Interactive Resource Allocation by Problem Decomposition and Temporal
نویسندگان
چکیده
Abstractions are generally thought to reduce the complexity of problem solving. In this report, we present two abstraction techniques and one partitioning heuristic to solve resource allocation problems. The clustering heuristic decomposes the resource allocation problem into easy and difficult components interacting through abstracted pools of resources. The hierarchy of resource pools allows the user to intervene in conflict resolution at the most appropriate level of abstraction. The temporal abstraction techniques simplify the decoupled components. They also aid the user in assessing the tightness of the problem and the types of missing resources. We propose an algorithm that interleaves these processes. The main advantages of our approach are limiting the need for backtracking, providing an interactive framework for conflict resolution, and offering a comprehensive view of resource contention. 1A shorter version of the report appears in the proceedings of the Second European Workshop on Planning [Choueiry and Faltings, 1994].ions are generally thought to reduce the complexity of problem solving. In this report, we present two abstraction techniques and one partitioning heuristic to solve resource allocation problems. The clustering heuristic decomposes the resource allocation problem into easy and difficult components interacting through abstracted pools of resources. The hierarchy of resource pools allows the user to intervene in conflict resolution at the most appropriate level of abstraction. The temporal abstraction techniques simplify the decoupled components. They also aid the user in assessing the tightness of the problem and the types of missing resources. We propose an algorithm that interleaves these processes. The main advantages of our approach are limiting the need for backtracking, providing an interactive framework for conflict resolution, and offering a comprehensive view of resource contention. 1A shorter version of the report appears in the proceedings of the Second European Workshop on Planning [Choueiry and Faltings, 1994].
منابع مشابه
Interactive Resource Allocation by Problem Decomposition and Temporal Abstractions
ions are generally thought to reduce the complexity of problem solving. In this paper, we present two abstraction techniques and one partitioning heuristic to solve resource allocation problems. The clustering heuristic decomposes the resource allocation problem into easy and diicult components interacting through abstracted pools of resources. The hierarchy of resource pools allows the user to...
متن کاملطراحی لایه- متقاطع برای کنترل ازدحام، مسیریابی و زمانبندی در شبکههای بیسیم ad-hocبا در نظرگرفتن توان الکتریکی گرهها
Abstract Ad hoc Wireless Networks, are networks formed by a collection of nodes through radio. In wireless networking environment, formidable challenges are presented. One important challenge is connection maintenance mechanism for power consumption. In this paper, a multi-objective optimal design is considered for ad-hoc networks which address the electrical power of nodes effects on cross-l...
متن کاملAn Intelligent Algorithm for Optimization of Resource Allocation Problem by Considering Human Error in an Emergency Department
Human error is a significant and ever-growing problem in the healthcare sector. In this study, resource allocation problem is considered along with human errors to optimize utilization of resources in an emergency department. The algorithm is composed of simulation, artificial neural network (ANN), design of experiment (DOE) and fuzzy data envelopment analysis (FDEA). It is a multi-response opt...
متن کاملScenario-based modeling for multiple allocation hub location problem under disruption risk: multiple cuts Benders decomposition approach
The hub location problem arises in a variety of domains such as transportation and telecommunication systems. In many real-world situations, hub facilities are subject to disruption. This paper deals with the multiple allocation hub location problem in the presence of facilities failure. To model the problem, a two-stage stochastic formulation is developed. In the proposed model, the number of ...
متن کاملModeling and analysis of air campaign resource allocation: a spatio-temporal decomposition approach
In this paper, we address the modeling and analysis issues associated with a generic theater level campaign where two adversaries pit their military resources against each other over a sequence of multiple engagements. In particular, we consider the scenario of an air raid campaign where one adversary uses suppression of enemy air defense (SEAD) aircraft and bombers (BMBs) against the other adv...
متن کامل